G-Maximization: an Unsupervised Learning Procedure for Discovering Regularities
نویسندگان
چکیده
Hill climbing is used to maximize an information theoretic measure of the difference between the actual behavior of a unit and the behavior that would be predicted by a statistician who knew the first order statistics of the inputs but believed them to be independent. This causes the unit to detect higher order correlations among its inputs. Initial simulations are presented, and seem encouraging. We describe an extension of the basic idea which makes it resemble competitive learning and which causes members of a population of these units to differentiate, each extracting different structure from the input.
منابع مشابه
An Unsupervised Learning Method for an Attacker Agent in Robot Soccer Competitions Based on the Kohonen Neural Network
RoboCup competition as a great test-bed, has turned to a worldwide popular domains in recent years. The main object of such competitions is to deal with complex behavior of systems whichconsist of multiple autonomous agents. The rich experience of human soccer player can be used as a valuable reference for a robot soccer player. However, because of the differences between real and simulated soc...
متن کاملFactorial Learning and the EM Algorithm
Many real world learning problems are best characterized by an interaction of multiple independent causes or factors. Discovering such causal structure from the data is the focus of this paper. Based on Zemel and Hinton's cooperative vector quantizer (CVQ) architecture, an unsupervised learning algorithm is derived from the Expectation-Maximization (EM) framework. Due to the combinatorial natur...
متن کاملDiscovering Test Set Regularities in Relational Domains
Machine learning typically involves discovering regularities in a training set, then applying these learned regularities to classify objects in a test set. In this paper we present an approach to discovering additional regularities in the test set, and show that in relational domains such test set regularities can be used to improve classification accuracy beyond that achieved using the trainin...
متن کاملEnsemble Learning Based Sparse High-Order Boltzmann Machine for Unsupervised Feature Interaction Identification
Identifying interpretable high-order feature interactions is important specially for biomedical applications. In an unsupervised setting, it is a challenging structure learning task. In this paper, we propose an Ensemble Learning based Sparse High-order Boltzmann Machine (ELSHBM) to identify interpretable high-order feature interactions. By converting the problem of data log-likelihood maximiza...
متن کاملDistributed Compression of Stereoscopic Images with Unsupervised Learning of Disparity
Distributed compression is particularly attractive for stereoscopic images since it avoids communication between cameras. Since compression performance depends on exploiting the redundancy between images, knowing the disparity is important at the decoder. Unfortunately, distributed encoders cannot calculate this disparity and communicate it. In this paper, we propose an Expectation Maximization...
متن کامل